Queue based mutual exclusion with linearly bounded overtaking
نویسندگان
چکیده
منابع مشابه
A mutual exclusion algorithm with optimally bounded bypasses
Peterson’s algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115–116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson’s algorithm, each process has to cross n− 1 stages to access the shared resource irrespective of the contention for the shared resource at that time, and allows unbounded bypasses. I...
متن کاملAn O(vn) Distributed Mutual Exclusion Algorithm Using Queue Migration
In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual ...
متن کاملTiming-Based Mutual Exclusion with Local Spinning
We consider the time complexity of shared-memory mutual exclusion algorithms based on reads, writes, and comparison primitives under the remotememory-reference (RMR) time measure. For asynchronous systems, a lower bound of Ω(log N/ log log N) RMRs per critical-section entry has been established in previous work, where N is the number of processes. In this paper, we show that lower RMR time comp...
متن کاملReal-Time Token-Based Mutual Exclusion Algorithms
Many token-based, distributed mutual exclusion algorithms can be generalized by a single algorithm. The algorithm’s performance is dependent upon the logical topology imposed on the nodes and the policy used to forward requests. This paper extends the generalized algorithm to support prioritized, real-time requests in a generalized fashion and presents models that can be used to analyze the per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2011
ISSN: 0167-6423
DOI: 10.1016/j.scico.2010.11.002